SMASH (Simulation Model of Activity Scheduling Heuristics): Some Simulations
نویسندگان
چکیده
منابع مشابه
Improving Local Search Heuristics for some Scheduling Problems. Part II
Local search techniques like simulated annealing and tabu search are based on a neighborhood structure defined on the set of feasible solutions of a discrete optimization problem. For the scheduling problems Pm )I C,,,,, 1 1 prec 1 1 Ui, and a large class of sequencing problems with precedence constraints having local interchange properties we replace a simple neighborhood by a neighborhood on ...
متن کاملImproving Local Search Heuristics for Some Scheduling Problems-I
Local search techniques like simulated annealing and tabu search are based on a neighborhood structure defined on a set of feasible solutions of a discrete optimization problem. For the scheduling problems P2 /) C,,,, 11 precl c C, and 1 112 T, we replace a simple neighborhood by a neighborhood on the set of all locally optimal solutions. This allows local search on the set of solutions that ar...
متن کاملHeuristics Analysis for Distributed Scheduling using MONARC Simulation Tool
Simulation is a very powerful method used for highperformance and high-quality design in distributed system, and now maybe the only one, considering the heterogeneity, complexity and cost of distributed systems. In Grid environments, foe example, it is hard and even impossible to perform scheduler performance evaluation in a repeatable and controllable manner as resources and users are distribu...
متن کاملComputer simulation of household activity scheduling
An operational model of household activity scheduling is proposed. The model is based on a theory entailing behavioral principles of how persons acquire, represent, and use information from and about the environment. Choices of destinations and departure times are consequences of the scheduling of a set of activities to be executed in a given time cycle. Illustrative computer simulations of the...
متن کاملHeuristics in Grid Scheduling
Grid computing aggregates heterogeneous resources for executing resource intensive applications of science and engineering. Grid scheduling is a complex problem (NP-hard) to map existing tasks to accessible storage and computational resources to utilize them in the optimistic manner. In this article, we have analyzed the grid scheduling problem, the process of job scheduling, challenges and app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Record: Journal of the Transportation Research Board
سال: 1996
ISSN: 0361-1981
DOI: 10.3141/1551-12